More polytopes meeting the conjectured Hirsch bound

نویسندگان

  • Kerstin Fritzsche
  • Fred B. Holt
چکیده

In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n ? d. Recently Holt and Klee constructed polytopes which meet this bound for a number of (d; n) pairs with d 13 and for all pairs (14; n). These constructions involve a judicious use of truncation, wedging, and blending on polytopes which already meet the Hirsch bound. In this paper we extend these techniques to construct poly-topes of edge-diameter n ? 8 for all (8; n). The improvement from d = 14 to d = 8 follows from identifying circumstances in which the results for wedging when n > 2d can be extended to the cases n 2d, our lemma 2.2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplex Methods Meeting the Conjectured Hirsch

In 1957, Hirsch conjectured that every d−polytopes with n facets has edge-diameter at most n − d. Recently Holt and Klee constructed polytopes which meet this bound for a number of (d, n) pairs with d ≤ 13 and for all pairs (14, n). The main purpose of this paper is to present linear Hirsch bound ⌊ 2 ⌋+ d− 2 for all pairs (d, n) and to review mathematical ideas behind simplex methods, investiga...

متن کامل

The Hierarchy of Circuit Diameters and Transportation Polytopes

The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch conjecture is true for general m×n–transportation polytopes. In earlier work the first three authors introduced a hierarchy of variations to the notion of graph dia...

متن کامل

Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d = 6. This implies that for all pairs (d, n) with n−d ≤ 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n − d ≤ 6. We show this result by showing this boun...

متن کامل

Diameter and Curvature: Intriguing Analogies

We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the results of Holt and Klee, and Klee and Walkup: We construct a family of polytopes which attain the conjectured order of the largest curvature, and prove that the special case where the number of inequalities is twice t...

متن کامل

An update on the Hirsch conjecture: Fifty-two years later

The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n− d. That is to say, we can go from any vertex to any other vertex using at most n− d edges. Despite being one of the most fundamental, basic and old problems in polytope theory, what we know is quite s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1998